Complexity classi cation of some edge modi cation problems
نویسندگان
چکیده
In an edge modi cation problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge modi cation problems with respect to some well-studied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomial when the input graph has bounded degree. We also give a general constant factor approximation algorithm for deletion and editing problems on bounded degree graphs with respect to properties that can be characterized by a nite set of forbidden induced subgraphs. ? 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Four types of e¤ect modication - a classication based on directed acyclic graphs
By expressing the conditional causal risk di¤erence as a sum of products of stratum speci c risk di¤erences and conditional probabilities, it is possible to give a classi cation of the types of causal relationships that can give rise to e¤ect modi cation on the risk di¤erence scale. Directed acyclic graphs make clear the necessary causal relationships for a particular variable to serve as an e¤...
متن کاملGeostatistical classi®cation for remote sensing: an introduction
Traditional spectral classi®cation of remotely sensed images applied on a pixel-by-pixel basis ignores the potentially useful spatial information between the values of proximate pixels. For some 30 years the spatial information inherent in remotely sensed images has been employed, albeit by a limited number of researchers, to enhance spectral classi®cation. This has been achieved primarily by ®...
متن کاملExtraction method of non-restrictive modification in Japanese as a marked factor of prosody
This paper shows by a quantitative evaluation that nonrestrictive modi cation in Japanese is a marked factor of prosody, and describes how to extract non-restrictive modication. In Japanese, restrictive and non-restrictive modi cation have the same syntactic structure, so it is di cult to distinguish them. We propose rules to extract non-restrictive modi cation in news-text based on the classi ...
متن کاملSome Approaches to Improve the Interpretability of Neuro-Fuzzy Classi ers
Neuro-fuzzy classi cation systems make it possible to obtain a suitable fuzzy classi er by learning from data. Nevertheless, in some cases the derived rule base is hard to interpret. In this paper we discuss some approaches to improve the interpretability of neuro-fuzzy classi cation systems. We present modi ed learning strategies to derive fuzzy classi cation rules from data, and some methods ...
متن کاملClassi cation using Bayesian Neural Nets
Recently, Bayesian methods have been proposed for neural networks to solve regression and classi cation problems. These methods claim to overcome some di culties encountered in the standard approach such as over tting. However, an implementation of the full Bayesian approach to neural networks as suggested in the literature applied to classi cation problems is not easy. In fact we are not aware...
متن کامل